A type-free system extending (ZFC)
نویسندگان
چکیده
منابع مشابه
Extending AlgBench with a Type System
This paper presents some design decisions taken in the ongoing project of extending the symbolic computation system AlgBench with a type system. The only mechanism for structuring values in Alg-Bench are classes which are rst-class values and anonymous, hence type constructors are simple functions. We show how within this approach abstract datatypes and categories can be modelled. Subtyping by ...
متن کاملA Brief Introduction to Zfc
We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular at students of mathematics who are familiar with set theory from a “naive” perspective, and are interested in the underlying axiomatic development. We will quickly review some basic concepts of set theory, before focusing on the set theoretic definition...
متن کاملA Type System for Lock-Free Processes
Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ ⊢ P as “Γ is an abstraction of a concrete process P .” (The relation “⊢” corresponds to a pair of abstraction/co...
متن کاملA Type System for Lock-Free Processes1
Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ P as “Γ is an abstraction of a concrete process P .” (The relation “ ” corresponds to a pair of abstraction/conc...
متن کاملCombinatorics in Zfc Limbo
In their paper, Large-scale regularities of lattice embeddings of posets [RW99], Remmel and Williamson studied extremal properties of posets and their incomparability graphs on N k . Properties (1) through (3) of their main result, Theorem 1.5, are proved using Ramsey theory. The proof of Theorem 1.5 (4), however, uses Friedman’s Jump Free Theorem ([Fri97] and [Fri98] ), a powerful ZFC independ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1989
ISSN: 0168-0072
DOI: 10.1016/0168-0072(89)90026-2